Speech emotion recognition with light gradient boosting decision trees machine

نویسندگان

چکیده

<p>Speech emotion recognition aims to identify the expressed in speech by analyzing audio signals. In this work, data augmentation is first performed on samples increase number of for better model learning. The are comprehensively encoded as frequency and temporal domain features. classification, a light gradient boosting machine leveraged. hyperparameter tuning determine optimal settings. As datasets imbalanced, class weights regulated be inversely proportional sample distribution where minority classes assigned higher weights. experimental results demonstrate that proposed method outshines state-of-the-art methods with 84.91% accuracy emo-DB dataset, 67.72% Ryerson audio-visual database emotional song (RAVDESS) 62.94% interactive dyadic motion capture (IEMOCAP) dataset.</p>

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Emotion recognition in speech signal using emotion- extracting binary decision trees

The presented paper is concerned with emotion recognition based on speech signal. Two novel elements introduced in the method are an introduction of novel set of emotional speech descriptors and an application of a binary-tree based classifier, where consecutive emotions are extracted at each node, based on an assessment of feature triplets. The method has been verified using two databases of e...

متن کامل

Speech Emotion Recognition Using Support Vector Machine

Speech Emotion Recognition (SER) is a hot research topic in the field of Human Computer Interaction (HCI). In this paper, we recognize three emotional states: happy, sad and neutral. The explored features include: energy, pitch, linear predictive spectrum coding (LPCC), mel-frequency spectrum coefficients (MFCC), and mel-energy spectrum dynamic coefficients (MEDC). A German Corpus (Berlin Datab...

متن کامل

Boosting Lazy Decision Trees

This paper explores the problem of how to construct lazy decision tree ensembles. We present and empirically evaluate a relevancebased boosting-style algorithm that builds a lazy decision tree ensemble customized for each test instance. From the experimental results, we conclude that our boosting-style algorithm significantly improves the performance of the base learner. An empirical comparison...

متن کامل

Boosting Decision Trees

A new boosting algorithm of Freund and Schapire is used to improve the performance of decision trees which are constructed usin: the information ratio criterion of Quinlan’s C4.5 algorithm. This boosting algorithm iteratively constructs a series of decision tress, each decision tree being trained and pruned on examples that have been filtered by previously trained trees. Examples that have been...

متن کامل

Speech recognition using soft decision trees

This paper presents recent developments at our site toward speech recognition using decision tree based acoustic models. Previously, robust decision trees have been shown to achieve better performance compared to standard Gaussian mixture model (GMM) acoustic models. This was achieved by converting hard questions (decisions) of a standard tree into soft questions using sigmoid function. In this...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of Power Electronics and Drive Systems

سال: 2023

ISSN: ['2722-2578', '2722-256X']

DOI: https://doi.org/10.11591/ijece.v13i4.pp4020-4028